Packing smaller graphs into a graph
نویسندگان
چکیده
منابع مشابه
Packing Trees into Planar Graphs
1 I n t r o d u c t i o n We say that the graphs H 1 , . . . , Hk can be packed into a graph G if G contains subgraphs isomorphic to H 1 , . . . , Hk and pairwise edge disjoint. The problem of packing graphs has been widely studied, especially when G is a complete graph. For instance, it is known that two trees with n vertices none of them equal to a star can be packed into K~ [2]. The packing ...
متن کاملPacking trees into n-chromatic graphs
We show that if a sequence of trees T1, T2, ..., Tn−1 can be packed into Kn then they can be also packed into any n-chromatic graph.
متن کاملPacking closed trails into dense graphs
It has been shown [Balister, 2001] that if n is odd and m1, . . . , mt are integers with mi ≥ 3 and ∑t i=1 mi = |E(Kn)| then Kn can be decomposed as an edge-disjoint union of closed trails of lengths m1, . . . , mt. Here we show that the corresponding result is also true for any sufficiently large and sufficiently dense even graph G.
متن کاملPacking and Squeezing Subgraphs into Planar Graphs
We consider the following problem: Given a set S of graphs, each of n vertices, construct an nvertex planar graph G containing all the graphs of S as subgraphs. We distinguish the variant in which any two graphs of S are required to have disjoint edges in G (known as ’packing’) from the variant in which distinct graphs of S can share edges in G (called ’squeezing’). About the packing variant we...
متن کاملPacking four copies of a tree into a complete graph
A graph G of order n is k-placeable if there exist k edge-disjoint copies of G in the complete graph Kn. Previous work characterized all trees that are k-placeable for k ≤ 3. This work extends those results by giving a complete characterization of all 4-placeable trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90072-1